منابع مشابه
Keeping Ahead of Our Adversaries
EVERY SOFTWARE SYSTEM is potentially vulnerable in ways that aren’t always imagined during development. For example, pacemakers and implantable cardioverterde brillators (ICDs), which monitor and regulate cardiac rhythms, typically provide wireless access to healthcare providers so that they can modify settings and collect telemetry. However, a malicious user could transmit commands to ICDs to ...
متن کاملTiny Groups Tackle Byzantine Adversaries
A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups are used as building blocks to design attack-resistant algorithms. Despite over a decade of active research, current constructions require group sizes of O(logn), where n is the number of participants in the system. T...
متن کاملWitness-Indistinguishability Against Quantum Adversaries
Proof systems are a central concept in complexity theory and cryptography. Zero-knowledge and witnessindistinguishability are useful security properties of proof systems. Considering the increased power of quantum computation, it comes as a natural question to understand what happens to these security properties when quantum computation becomes feasible. Zero-knowledge [GMR89] is the security p...
متن کاملRepeated Games against Budgeted Adversaries
We study repeated zero-sum games against an adversary on a budget. Given that an adversary has some constraint on the sequence of actions that he plays, we consider what ought to be the player’s best mixed strategy with knowledge of this budget. We show that, for a general class of normal-form games, the minimax strategy is indeed efficiently computable and relies on a “random playout” techniqu...
متن کاملRepeated Games against Budgeted Adversaries
We study repeated zero-sum games against an adversary on a budget. Given that an adversary is constrained by the amount he can play each action, we consider what ought to be the player’s best mixed strategy with knowledge of this budget. We show that, for a general class of normal-form games, the minimax strategy is indeed efficiently computable and relies on a simple random walk.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Humanities
سال: 2018
ISSN: 2076-0787
DOI: 10.3390/h7030075